A New (n, n)-threshold Reversible Secret Image Sharing Using Histogram Shifting

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New (k, n) Secret Image Sharing Scheme (SISS)

In this paper, a new (k, n) threshold Secret Image Sharing Scheme (SISS) is proposed. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is assumed as the vertices of a complete graph G. Each spanning tree of G is represented by k pixels along with Prüfer sequence and used to form k pixels of a share image. The original se...

متن کامل

Threshold Secret Image Sharing

A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...

متن کامل

Some Algebraic (n, n)-Secret Image Sharing Schemes

We have presented some algebraic (n, n)threshold schemes in [3]. In this paper we proposed the algebraic (n, n)secret image sharing schemes.

متن کامل

Reversible image hiding scheme using predictive coding and histogram shifting

In this paper, a reversible image hiding scheme based on histogram shifting for medical images is proposed. As we know, the histogram-based reversible data hiding is limited by the hiding capacity, which is influenced by the overhead of position information that has to be embedded in the host image. To solve this problem, the similarity of neighboring pixels in the images was explored by using ...

متن کامل

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes

In this paper, we show that there exists a t-cheater identi able (k; n) threshold secret sharing scheme such as follows for cheating probability " > 0. If k 3t+ 1, then 1. Just k participants are enough to identify who are cheaters. 2. jV i j is independent of n. That is, jV i j = jSj(1=") (t+2) , where S denotes the set of secrets and V i denotes the set of shares of a participant P i , respec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Security and Its Applications

سال: 2015

ISSN: 1738-9976,1738-9976

DOI: 10.14257/ijsia.2015.9.1.25